Fast Exact Booleans for Iterated CSG using Octree-Embedded BSPs

We present octree-embedded BSPs, a volumetric mesh data structure suited for performing sequence of Boolean operations (iterated CSG) efficiently. At its core, our leverages plane-based geometry representation and integer arithmetics to guarantee unconditionally robust operations. These typically considerable performance challenges which we overcome by using custom-tailored fixed-precision an efficient algorithm cutting convex against plane. Consequently, BSP Booleans extraction are formulated in terms cutting. The octree is used as global acceleration keep modifications local bound the complexity. With optimizations, can perform up 2.5 million mesh-plane cuts per second on single creates roughly 40-50 output nodes CSG. demonstrate system two iterated CSG settings: sweep volumes milling simulation.